A New Lehmer Pair of Zeros and a New Lower Bound for the De Bruijn-newman Constant
نویسندگان
چکیده
∗ Received November 24, 1993. Accepted for publication December 13, 1993. Communicated by A. Ruttan. Corrected June 29, 1994. The original manuscript is stored in vol.1.1993/pp104111.dir/pp104-111orig.ps † Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA. (e-mail: [email protected]). ‡ AT&T Bell Labs, 2C-355, Murray Hill, NJ 07974, USA. (e-mail: [email protected]). § Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA. (e-mail: [email protected]). ¶ Institute for Computational Mathematics, Kent State University, Kent, OH 44242 (e-mail: [email protected]).
منابع مشابه
An improved lower bound for the de Bruijn-Newman constant
In this article, we report on computations that led to the discovery of a new Lehmer pair of zeros for the Riemann ζ function. Given this new close pair of zeros, we improve the known lower bound for de Bruijn-Newman constant Λ. The Riemann hypothesis is equivalent to the assertion Λ ≤ 0. In this article, we establish that in fact we have Λ > −1.14541×10−11. This new bound confirms the belief t...
متن کاملNewman’s Conjecture in Various Settings
De Bruijn and Newman introduced a deformation of the Riemann zeta function ζ(s), and found a real constant Λ which encodes the movement of the zeros of ζ(s) under the deformation. The Riemann hypothesis (RH) is equivalent to Λ ≤ 0. Newman made the conjecture that Λ ≥ 0 along with the remark that “the new conjecture is a quantitative version of the dictum that the Riemann hypothesis, if true, is...
متن کاملNewman’s Conjecture in Function Fields
De Bruijn and Newman introduced a deformation of the completed Riemann zeta function ζ, and proved there is a real constant Λ which encodes the movement of the nontrivial zeros of ζ under the deformation. The Riemann hypothesis is equivalent to the assertion that Λ ¤ 0. Newman, however, conjectured that Λ ¥ 0, remarking, “the new conjecture is a quantitative version of the dictum that the Riema...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کامل